On some extensions of the FKN theorem
نویسندگان
چکیده
Let S = a1r1+a2r2+ · · ·+anrn be a weighted Rademacher sum. Friedgut, Kalai, and Naor have shown that if Var(|S|) is much smaller than Var(S), then the sum is largely determined by one of the summands. We provide a simple and elementary proof of this result, strengthen it, and extend it in various ways to a more general setting. ACM Classification: G.3 AMS Classification: 60E15, 42C10
منابع مشابه
Some extensions of Darbo's theorem and solutions of integral equations of Hammerstein type
In this brief note, using the technique of measures of noncompactness, we give some extensions of Darbo fixed point theorem. Also we prove an existence result for a quadratic integral equation of Hammerstein type on an unbounded interval in two variables which includes several classes of nonlinear integral equations of Hammerstein type. Furthermore, an example is presented to show the effic...
متن کاملOn the compactness property of extensions of first-order G"{o}del logic
We study three kinds of compactness in some variants of G"{o}del logic: compactness,entailment compactness, and approximate entailment compactness.For countable first-order underlying language we use the Henkinconstruction to prove the compactness property of extensions offirst-order g logic enriched by nullary connective or the Baaz'sprojection connective. In the case of uncountable first-orde...
متن کاملExtensions of Some Fixed Point Theorems for Weak-Contraction Mappings in Partially Ordered Modular Metric Spaces
The purpose of this paper is to establish fixed point results for a single mapping in a partially ordered modular metric space, and to prove a common fixed point theorem for two self-maps satisfying some weak contractive inequalities.
متن کاملDesigning Path for Robot Arm Extensions Series with the Aim of Avoiding Obstruction with Recurring Neural Network
In this paper, recurrent neural network is used for path planning in the joint space of the robot with obstacle in the workspace of the robot. To design the neural network, first a performance index has been defined as sum of square of error tracking of final executor. Then, obstacle avoidance scheme is presented based on its space coordinate and its minimum distance between the obstacle and ea...
متن کاملArrow theorems in the fuzzy setting
Throughout this paper, our main idea is to analyze the Arrovian approach in a fuzzy context, paying attention to different extensions of the classical Arrow's model arising in mathematical Social Choice to aggregate preferences that the agents define on a set of alternatives. There is a wide set of extensions. Some of them give rise to an impossibility theorem as in the Arrovian classical mod...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Theory of Computing
دوره 11 شماره
صفحات -
تاریخ انتشار 2015